On Extremal Graphs With No Long Paths
نویسندگان
چکیده
منابع مشابه
On Extremal Graphs With No Long Paths
Connected graphs with minimum degree δ and at least 2δ+ 1 vertices have paths with at least 2δ + 1 vertices. We provide a characterization of all such graphs which have no longer paths. Extremal problems involving paths and cycles have been considered since the infancy of graph theory. The question which interests us here is the question of what minimum degree condition guarantees a path of a p...
متن کاملExtremal Graphs for Clique-Paths
In this paper we deal with a Turán-type problem: given a positive integer n and a forbidden graph H , how many edges can there be in a graph on n vertices without a subgraph H? How does a graph look like if it has this extremal edge number? The forbidden graph in this article is a clique-path: a path of length k where each edge is extended to an r-clique, r ≥ 3. We determine both the extremal n...
متن کاملOn extremal weighted digraphs with no heavy paths
Bollobás and Scott proved that if the weighted outdegree of every vertex of a weighted digraph is at least 1, then it contains a (directed) path of weight at least 1. In this note we characterize the extremal weighted digraphs with no heavy paths. Our result is an extension of a corresponding theorem of Bondy and Fan in weighted graphs. Besides, we give examples showing the invalidity of genera...
متن کاملComplete Bipartite Graphs with No Rainbow Paths
Motivated by questions in Ramsey theory, Thomason and Wagner described the edge colorings of complete graphs that contain no rainbow path Pt of order t. In this paper, we consider the edge colorings of complete bipartite graphs that contain no rainbow path Pt. Mathematics Subject Classification: 05C15, 05C38, 05C55
متن کاملExtremal Graphs Having No Stable Cutsets
A stable cutset in a graph is a stable set whose deletion disconnects the graph. It was conjectured by Caro and proved by Chen and Yu that any graph with n vertices and at most 2n − 4 edges contains a stable cutset. The bound is tight, as we will show that all graphs with n vertices and 2n− 3 edges without stable cutset arise recursively glueing together triangles and triangular prisms along an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1996
ISSN: 1077-8926
DOI: 10.37236/1244